1

On an algorithm of Zemlyachenko for subtree isomorphism

Year:
1999
Language:
english
File:
PDF, 91 KB
english, 1999
3

A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs

Year:
1999
Language:
english
File:
PDF, 103 KB
english, 1999
4

Two absolute bounds for distributed bit complexity

Year:
2007
Language:
english
File:
PDF, 456 KB
english, 2007
5

On the totalk-diameter of connection networks

Year:
2000
Language:
english
File:
PDF, 199 KB
english, 2000
6

Exact communication costs for consensus and leader in a tree

Year:
2003
Language:
english
File:
PDF, 229 KB
english, 2003
7

Low-Light Trees, and Tight Lower Bounds for

Year:
2010
Language:
english
File:
PDF, 1.05 MB
english, 2010
8

On the Single-Source Unsplittable Flow Problem

Year:
1999
Language:
english
File:
PDF, 323 KB
english, 1999
13

GUARDING RECTANGULAR PARTITIONS

Year:
2009
Language:
english
File:
PDF, 239 KB
english, 2009
14

A COMPACT LAYOUT OF THE BUTTERFLY

Year:
2003
Language:
english
File:
PDF, 1.53 MB
english, 2003
15

Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem

Year:
2008
Language:
english
File:
PDF, 154 KB
english, 2008
16

Bit complexity of breaking and achieving symmetry in chains and rings

Year:
2008
Language:
english
File:
PDF, 252 KB
english, 2008
20

Hybrid Bellman–Ford–Dijkstra algorithm

Year:
2017
Language:
english
File:
PDF, 352 KB
english, 2017